Search results for "Constraint satisfaction problem"

showing 5 items of 5 documents

Counting by Statistics on Search Trees: Application to Constraint Satisfaction Problems

1997

In 1975, Knuth proposed a simple statistical method for investigating search trees. We use this technique for estimating the number of solutions of constraint satisfaction problem CSP and boolean satisfiability problem SAT instances. We show that, depending on domain reductions, tree-based estimates have a lower variance than estimates based on uniform sampling from the search space. Nevertheless, because the variance remains extremely high in the general case, a confidence interval cannot be derived, but a lower bound of the number of solutions. These results are confirmed by many experiments.

Complexity of constraint satisfactionBacktrackingConstraint graphArtificial IntelligenceStatisticsConstraint satisfaction dual problemHybrid algorithm (constraint satisfaction)Local consistencyComputer Vision and Pattern RecognitionConstraint satisfactionConstraint satisfaction problemMathematicsTheoretical Computer ScienceIntelligent Data Analysis
researchProduct

Decision Support Systems Based on CLP Approach in SMEs

2006

The paper focuses on a selected class of decision problems related with the production flow planning in SMEs, particularly in new production orders. Verification of orders gives a possibility to evaluate whether resources capacity of a manufacturer is balanced with the orderer's requirements. The class of decision problems under analysis is included in the scope of organizational production preparation and can be naturally determined by available CLP (Constraint Logic Programming) tools. The approach proposed in the paper is based on establishment of an interface which facilitates its task oriented use. The system has been presented on the basis of a sample order execution in a manufacturer…

Constraint logic programmingDecision support systemClass (computer programming)Operations researchScope (project management)Computer scienceInterface (Java)Constraint satisfaction problemDecision problemFlow planningDecision supportConstraint logic programmingSystems engineeringProduction (economics)Constraint satisfaction problem2006 IEEE Conference on Emerging Technologies and Factory Automation
researchProduct

Guaranteed tuning of PID controllers for parametric uncertain systems

2004

This paper presents a methodology for tuning the controller of a parametric uncertain plant in order to guarantee the satisfaction of specifications. These specifications are defined by means of an interval reference model that represents the set of satisfactory time or frequency behaviors. The controller synthesis is then formulated as a set-inclusion problem in the frequency domain. Interval techniques for the solution of constraint satisfaction problems are applied to design fixed-structure controllers in a guaranteed manner. In particular, PID controllers are considered since they are widely used in industry.

Control theoryFrequency domainPID controllerControl engineeringInterval (mathematics)Set theoryReference modelConstraint satisfaction problemParametric statisticsMathematics2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)
researchProduct

Towards Interactive CLP – Based and Project Driven Oriented DSS Design

2007

Robert Wojcik*, Izabela Tomczuk-Pirog**, Zbigniew Banaszak*** * Institute of Computer Engineering, Control and Robotics, Wroclaw University of Technology, Poland, robert.wojcik@pwr.wroc.pl ** Department of Management and Production Engineering, Technical University of Opole, Poland, itomczuk@po.opole.pl *** Department of Computer Science and Management, Technical University of Koszalin, Poland, banaszak@tu.koszalin.pl

Decision support systemEngineering managementEngineeringbusiness.industryTechnical universityControl (management)Project drivenProduction engineeringRoboticsArtificial intelligenceProduction orderbusinessConstraint satisfaction problem
researchProduct

Adding Partial Functions to Constraint Logic Programming with Sets

2015

AbstractPartial functions are common abstractions in formal specification notations such as Z, B and Alloy. Conversely, executable programming languages usually provide little or no support for them. In this paper we propose to add partial functions as a primitive feature to a Constraint Logic Programming (CLP) language, namely {log}. Although partial functions could be programmed on top of {log}, providing them as first-class citizens adds valuable flexibility and generality to the form of set-theoretic formulas that the language can safely deal with. In particular, the paper shows how the {log} constraint solver is naturally extended in order to accommodate for the new primitive constrain…

FOS: Computer and information sciencesComputer Science - Programming LanguagesProgramming languageComputer scienceOrder (ring theory)computer.file_formatcomputer.software_genreNotationTheoretical Computer ScienceComputational Theory and MathematicsArtificial IntelligenceHardware and ArchitectureFormal specificationPartial functionConstraint logic programmingExecutableSet theorycomputerSoftwareConstraint satisfaction problemProgramming Languages (cs.PL)
researchProduct